Measuring Parallel Performance of Sorting Algorithms
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Parallel Sorting Algorithms using GPU Computing
Sorting is a well interrogating issue in computer science. Many authors have invented numerous sorting algorithms on CPU (Central Processing Unit). In today's life sorting on the CPU is not so efficient. To get the efficient sorting parallelization should be done. There are many ways of parallelization of sorting but at the present time GPU (Graphics Processing Unit) computing is the most ...
متن کاملComparison of parallel sorting algorithms
In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were implemented on a central processing unit using C++, whereas parallel algorithms were implemented on a graphics processing unit using CUDA platform. We chose these algo...
متن کاملFast Parallel Sorting Algorithms on Gpus
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: OddEven sort, Rank sort and Bitonic sort in terms of sorting rate, sorting time and speed-up on CPU and different GPU architectures. Alongside we have implemented novel parallel algorithm: min-max butterfly network, for finding minimum and maximum in large data sets. All algorithms have been impleme...
متن کاملEvaluation Performance of Spike Sorting Algorithms
Many questions in Neuroscience are dependent on analyzing neuronal spike activity recorded during certain behavior tasks. In other words, neural spike activity is the electrical activity that occurs in brain cells when active. For this reason data acquired from numerous neurons are essential in elucidating the underlying principle of neural information processing. Recently, commercially availab...
متن کاملA Practical Performance Comparison of Parallel Sorting Algorithms on Homogeneous Network of Workstations
Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. A homogeneous cluster of workstations has been used to compare the algorithms implemented. The MPI library has been selected to establish the communication and synchronization be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2018
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v12n10p23